Combinatory logic

Results: 540



#Item
51RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK  Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing

RAMSEY’S THEOREM FOR SINGLETONS AND STRONG COMPUTABLE REDUCIBILITY DAMIR D. DZHAFAROV, LUDOVIC PATEY, REED SOLOMON, AND LINDA BROWN WESTRICK Abstract. We answer a question posed by Hirschfeldt and Jockusch by showing

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2016-05-31 11:43:35
52c ACM, 2009. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym

c ACM, 2009. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22
53Notre Dame Journal of Formal Logic Volume 50, Number 1, 2009 Factorization of the Shoenfield-like Bounded Functional Interpretation Jaime Gaspar

Notre Dame Journal of Formal Logic Volume 50, Number 1, 2009 Factorization of the Shoenfield-like Bounded Functional Interpretation Jaime Gaspar

Add to Reading List

Source URL: jg.sdf.org

Language: English - Date: 2016-05-02 10:01:00
54COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th

COLORING THE RATIONALS IN REVERSE MATHEMATICS EMANUELE FRITTAION AND LUDOVIC PATEY Abstract. Ramsey’s theorem for pairs asserts that every 2-coloring of the pairs of integers has an infinite monochromatic subset. In th

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-08-07 15:59:27
55IEEE TRANSACTIONS  888 ON CIRCUITS

IEEE TRANSACTIONS 888 ON CIRCUITS

Add to Reading List

Source URL: isl.stanford.edu

Language: English - Date: 2004-09-20 19:09:46
56JMLR: Workshop and Conference Proceedings vol 40:1–21, 2015  Second-order Quantile Methods for Experts and Combinatorial Games Wouter M. Koolen

JMLR: Workshop and Conference Proceedings vol 40:1–21, 2015 Second-order Quantile Methods for Experts and Combinatorial Games Wouter M. Koolen

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2015-07-20 20:08:36
57Optimal Social Laws Thomas Ågotnes ∗  Michael Wooldridge

Optimal Social Laws Thomas Ågotnes ∗ Michael Wooldridge

Add to Reading List

Source URL: www.aamas-conference.org

Language: English - Date: 2010-03-31 10:16:42
58Automated reasoning under the theory H∗ (thesis abstract) Fritz Obermeyer February 23, 2009  In this thesis I study four extensions of untyped λ-calculi all under the maximally coarse semantics of

Automated reasoning under the theory H∗ (thesis abstract) Fritz Obermeyer February 23, 2009 In this thesis I study four extensions of untyped λ-calculi all under the maximally coarse semantics of

Add to Reading List

Source URL: fritzo.org

Language: English - Date: 2014-11-27 11:35:14
59Tackling Fibonacci words puzzles by finite countermodels Alexei Lisitsa1 Department of Computer Science, The University of Liverpool

Tackling Fibonacci words puzzles by finite countermodels Alexei Lisitsa1 Department of Computer Science, The University of Liverpool

Add to Reading List

Source URL: cgi.csc.liv.ac.uk

Language: English - Date: 2013-06-10 17:15:26
60The ∇-Calculus. Functional Programming with Higher-order Encodings. Carsten Sch¨ urmann, Adam Poswolsky, Jeffrey Sarnat Yale University

The ∇-Calculus. Functional Programming with Higher-order Encodings. Carsten Sch¨ urmann, Adam Poswolsky, Jeffrey Sarnat Yale University

Add to Reading List

Source URL: www.itu.dk

Language: English - Date: 2004-11-03 09:40:39